American Statistical Association (K5)
نویسندگان
چکیده
منابع مشابه
American Statistical Association
Many states and school districts have adopted Value-Added Models (VAMs) as part of educational accountability systems. The goal of these models, which are also referred to as Value-Added Assessment (VAA) Models, is to estimate effects of individual teachers or schools on student achievement while accounting for differences in student background. VAMs are increasingly promoted or mandated as a c...
متن کاملJournal of the American Statistical Association
The concept of conditional experimental frames of reference has a significance for the general theory of statistical inference which has been emphasized by R. A. Fisher, D. R. Cox, J. W. Tukey, and others. This concept is formulated as a principle of conditionality, from which some general consequences are deduced mathematically. These include the likelihood principle, which has not hitherto be...
متن کامل694 Journal of the American Statistical Association, June 2009 Discussion
I commend Johnstone and Lu for publishing this important article, which has motivated quite a lot of recent work on sparsity and statistical inference in high-dimensional settings. In their article, Johnstone and Lu present two main results. First, in the presence of considerable noise in the x variables, with a number of samples n not significantly larger than the number of variables p, the sa...
متن کاملR(C6, K5) = 21andR(C7, K5) = 25
R(C4, K4) = 10 (see [2]) R(C4, K5) = 14 (see [3]) R(C5, K4) = 13, R(C5, K5) = 17 (see [5, 6]) R(Cn, K3) = 2n − 1 (n > 3) (see [4, 7]). In [10], we proved that R(Cn, K4) = 3(n − 1) + 1 (n ≥ 4). In this paper, we will prove that R(Cn, K5) = 4(n − 1)+ 1 (n = 6, 7). The following notations will be used in this paper. If G is a graph, the vertex set (resp. edge set) of G is denoted by V (G) (resp. E...
متن کاملThe Ramsey Number r(K5-P3,K5)
For two given graphs G1 and G2, the Ramsey number r(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Km denote a complete graph of order m and Kn −P3 a complete graph of order n without two incident edges. In this paper, we prove that r(K5 − P3,K5) = 25 without help of computer algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1958
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.127.3295.419